A context-aware decision engine for content adaptation

Building a good content adaptation service for mobile devices poses many challenges. To meet these challenges, this quality-of-service-aware decision engine automatically negotiates for the appropriate adaptation decision for synthesizing an optimal content version.published_or_final_versio

Tighter layouts of the cube-connected cycles

Preparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981 [17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we 'unfold' the cycles in the CCC, the resulting structure can be laid out in optimal area.published_or_final_versio

A tight layout of the cube-connected cycles

Preparata and Vuillemin proposed the cubeconnected cycles (CCC) in 1981 [lS], and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of th,e Preparata- Vuillemin layout. We also give a non-trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new layout and the lower bound. We conjectur.e that the new layout is optimal (minimal).published_or_final_versio

Performance of chaos-based communication systems under the influence of coexisting conventional spread-spectrum systems

Author name used in this publication: Francis C. M. LauAuthor name used in this publication: Chi K. Tse2003-2004 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

A tight layout of the cube-connected cycles

Preparata and Vuillemin proposed the cubeconnected cycles (CCC) in 1981 [lS], and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of th,e Preparata- Vuillemin layout. We also give a non-trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new layout and the lower bound. We conjectur.e that the new layout is optimal (minimal).published_or_final_versio

Comments on "a new family of Cayley graph interconnection networks of constant degree four"

Vadapalli and Srimani [2] have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed. © 1997 IEEE.published_or_final_versio

Co-existence of chaos-based and conventional digital communication systems

Author name used in this publication: Francis C. M. LauAuthor name used in this publication: Chi K. TseRefereed conference paper2002-2003 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

On the space requirement of interval routing

Interval routing is a space-efficient method for point-to-point networks. It is based on labeling the edges of a network with intervals of vertex numbers (called interval labels). An M-label scheme allows up to M labels to be attached on an edge. For arbitrary graphs of size n, n the number of vertices, the problem is to determine the minimum M necessary for achieving optimality in the length of the longest routing path. The longest routing path resulted from a labeling is an important indicator of the performance of any algorithm that runs on the network. We prove that there exists a graph with D = Ω(n1/3) such that if M ≤ n/18D - O(√n/D), the longest path is no shorter than D + Θ(D/√M). As a result, for any M-label IRS, if the longest path is to be shorter than D + Θ(D/√M), at least M = Ω(n/D) labels per edge would be necessary.published_or_final_versio

User-centric adaptation of structured Web documents for small devices

Content adaptation is a crucial step in making desktop-oriented web resources available to mobile, small device users. In this paper, we propose a decision engine comprising a content analysis module and a negotiation module to serve as the core of a content adaptation architecture. The content analysis module parses a structured web document originally intended for the desktop into small sections and transforms the document into a form that is best suited for rendering in a constrained mobile device. The transformation also provides the user with the best content value in an adapted web page while preserving content integrity. With the transformed document, the negotiation module selects the best rendering parameters to be used in the synthesis of an optimal adapted version of the content. The decisions made are based on the user's preference and QoS considerations. We have built a prototype to demonstrate the viability of our approach. © 2005 IEEE.published_or_final_versio

Curricula 2001: a brief summary

Model curricula are important resources for curricula planning and design. A joint task force between IEEE-CS and ACM was formed to undertake the responsibility of revising the 1991 model curricula. The effort is now underway, and the result will be known as Curricula 2001.published_or_final_versio